A technique for generating regional climate scenarios using a nearest neighbor bootstrap
نویسندگان
چکیده
A K-nearest neighbor (K-nn) re-sampling scheme is presented that simulates daily weather variables, and consequently seasonal climate and spatial and temporal dependencies, at multiple stations in a given region. A strategy is introduced that uses the K-nn algorithm to produce alternative climate data-sets conditioned upon hypothetical climate scenarios – e.g. warmer-drier springs, warmer-wetter winters, etc. This technique allows for the creation of ensembles of climate scenarios that can be used in integrated assessment and water resource management models for addressing the potential impacts of climate change and climate variability. This K-nn algorithm makes use of the Mahalanobis distance as the metric for neighbor selection, as opposed to a Euclidian distance. The advantage of the Mahalanobis distance is the fact that the variables do not have to be standardized nor is there a requirement to pre-assign weights to variables. An adaptable, moving window is used to identify candidate neighbors. The model is applied to two sets of station data in climatologically diverse areas of the US, including the Rocky Mountains and the North Central US and is shown to reproduce synthetic series that largely preserve important cross and autocorrelations. Likewise, the adapted K-nn algorithm is used to generate alternative climate scenarios based upon prescribed conditioning criteria.
منابع مشابه
A technique for generating regional climate scenarios using a nearest-neighbor algorithm
[1] A K-nearest neighbor (K-nn) resampling scheme is presented that simulates daily weather variables, and consequently seasonal climate and spatial and temporal dependencies, at multiple stations in a given region. A strategy is introduced that uses the K-nn algorithm to produce alternative climate data sets conditioned upon hypothetical climate scenarios, e.g., warmer-drier springs, warmer-we...
متن کاملFUZZY K-NEAREST NEIGHBOR METHOD TO CLASSIFY DATA IN A CLOSED AREA
Clustering of objects is an important area of research and application in variety of fields. In this paper we present a good technique for data clustering and application of this Technique for data clustering in a closed area. We compare this method with K-nearest neighbor and K-means.
متن کاملDrought Monitoring and Prediction using K-Nearest Neighbor Algorithm
Drought is a climate phenomenon which might occur in any climate condition and all regions on the earth. Effective drought management depends on the application of appropriate drought indices. Drought indices are variables which are used to detect and characterize drought conditions. In this study, it was tried to predict drought occurrence, based on the standard precipitation index (SPI), usin...
متن کاملNeural Network Ensembles from Training Set Expansions
In this work we propose a new method to create neural network ensembles. Our methodology develops over the conventional technique of bagging, where multiple classifiers are trained using a single training data set by generating multiple bootstrap samples from the training data. We propose a new method of sampling using the k-nearest neighbor density estimates. Our sampling technique gives rise ...
متن کاملA Bootstrap Technique for Nearest Neighbor Classifier Design
A bootstrap technique for nearest neighbor classifier design is proposed. Our primary interest in designing a classifier is in small training sample size situations. Conventional bootstrapping techniques sample the training samples with replacement. On the other hand, our technique generates bootstrap samples by locally combining original training samples. The nearest neighbor classifier is des...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002